Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
نویسندگان
چکیده
منابع مشابه
A Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملRobust optimization under multiband uncertainty
We provide an overview of the main results that we obtained studying uncertain mixed integer linear programs when the uncertainty is represented through the new multiband model [4]. Such model extends and refines the classical one proposed by Bertsimas and Sim [2] and is particularly suitable in the common case of arbitrary non-symmetric distributions of the uncertainty. Our investigations were...
متن کاملConstructing Uncertainty Sets for Robust Linear Optimization
In this paper, we propose a methodology for constructing uncertainty sets within the framework of robust optimization for linear optimization problems with uncertain parameters. Our approach relies on decision-maker risk preferences. Specifically, we utilize the theory of coherent risk measures initiated by Artzner et al. [3], and show that such risk measures, in conjunction with the support of...
متن کاملMaximizing Non-monotone Submodular Functions under Matroid and Knapsack Constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the firs...
متن کاملPreprocessing Under Uncertainty: Matroid Intersection
We continue the study of preprocessing under uncertainty that was initiated independently by Assadi et al. (FSTTCS 2015) and Fafianie et al. (STACS 2016). Here, we are given an instance of a tractable problem with a large static/known part and a small part that is dynamic/uncertain, and ask if there is an efficient algorithm that computes an instance of size polynomial in the uncertain part of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2746226